________________________________________________________________

Run Header: Complete YList Version try 5: /small pw steps

Run start:        31.01.2010 10:32:23
Input Data from:  dataset130.txt
Iteration limit:  500
NI iter. limit:   200

# of Customers  :300
# of Locations  :10
Ex.Facilities   :2
Total budget    :20000
Terror. attacks :3

Penalty Weight : 0,5
Update Policy  : 4-3 of last 10
pw inc. step   : 0,005

Coverage Ratio :0,174333333333333
Average f[i]   :4450
Average g[i,j] :2062,5
Total demand   :16690
________________________________________________________________

## ITERATION 0 #######################


> Neighbours evaluated; 9
> Selected Move:	0	1	-1	2	6500


> New Y[]: 
	
	 2  3  1  0  0  0  0  0  0  0 


> New S[]: 
	
	 1  1  1  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 1 #######################


> Neighbours evaluated; 8
> Selected Move:	3200	1	-1	4	11500


> New Y[]: 
	
	 2  3  1  0  1  0  0  0  0  0    >new incumb.: 3200


> New S[]: 
	
	 1  1  0  0  1  0  0  0  0  0 
 > pw :0,5

## ITERATION 2 #######################


> Neighbours evaluated; 31
> Selected Move:	4480	1	-1	7	17000


> New Y[]: 
	
	 2  3  1  0  1  0  0  1  0  0    >new incumb.: 4480


> New S[]: 
	
	 1  1  0  0  1  0  0  0  0  0 
 > pw :0,5

## ITERATION 3 #######################


> Neighbours evaluated; 37
> Selected Move:	4520	1	-1	5	21000


> New Y[]: 
	
	 2  3  1  0  1  1  0  1  0  0 


> New S[]: 
	
	 1  1  0  0  1  0  0  0  0  0 
 > pw :0,5

## ITERATION 4 #######################


> Neighbours evaluated; 40
> Selected Move:	5100	3	2	3	21000


> New Y[]: 
	
	 2  3  0  1  1  1  0  1  0  0 


> New S[]: 
	
	 0  1  0  0  0  1  0  1  0  0 
 > pw :0,5

## ITERATION 5 #######################


> Neighbours evaluated; 38
> Selected Move:	5180	3	7	9	20000


> New Y[]: 
	
	 2  3  0  1  1  1  0  0  0  1    >new incumb.: 5180


> New S[]: 
	
	 1  1  0  0  1  0  0  0  0  0 
 > pw :0,5

## ITERATION 6 #######################


> Neighbours evaluated; 39
> Selected Move:	5240	3	3	8	20000


> New Y[]: 
	
	 2  3  0  0  1  1  0  0  1  1    >new incumb.: 5240


> New S[]: 
	
	 1  1  0  0  1  0  0  0  0  0 
 > pw :0,495

## ITERATION 7 #######################


> Neighbours evaluated; 40
> Selected Move:	5105	3	9	7	21000


> New Y[]: 
	
	 2  3  0  0  1  1  0  1  1  0 


> New S[]: 
	
	 0  1  0  0  0  1  0  1  0  0 
 > pw :0,49

## ITERATION 8 #######################


> Neighbours evaluated; 37
> Selected Move:	4865	3	5	9	21500


> New Y[]: 
	
	 2  3  0  0  1  0  0  1  1  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  1  0  1 
 > pw :0,485

## ITERATION 9 #######################


> Neighbours evaluated; 38
> Selected Move:	4872	3	8	3	21500


> New Y[]: 
	
	 2  3  0  1  1  0  0  1  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  1  0  1 
 > pw :0,49

## ITERATION 10 #######################


> Neighbours evaluated; 37
> Selected Move:	4620	3	7	6	22000


> New Y[]: 
	
	 2  3  0  1  1  0  1  0  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  1  0  0  1 
 > pw :0,495

## ITERATION 11 #######################


> Neighbours evaluated; 34
> Selected Move:	4858	3	9	5	21500


> New Y[]: 
	
	 2  3  0  1  1  1  1  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  1  1  0  0  0 
 > pw :0,5

## ITERATION 12 #######################


> Neighbours evaluated; 34
> Selected Move:	4850	3	3	8	21500


> New Y[]: 
	
	 2  3  0  0  1  1  1  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  1  1  0  0  0 
 > pw :0,505

## ITERATION 13 #######################


> Neighbours evaluated; 36
> Selected Move:	4590	3	5	9	22000


> New Y[]: 
	
	 2  3  0  0  1  0  1  0  1  1 


> New S[]: 
	
	 0  1  0  0  0  0  1  0  0  1 
 > pw :0,51

## ITERATION 14 #######################


> Neighbours evaluated; 35
> Selected Move:	4325	3	6	2	22500


> New Y[]: 
	
	 2  3  1  0  1  0  0  0  1  1 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  1 
 > pw :0,515

## ITERATION 15 #######################


> Neighbours evaluated; 38
> Selected Move:	4570	3	9	5	22000


> New Y[]: 
	
	 2  3  1  0  1  1  0  0  1  0 


> New S[]: 
	
	 0  1  1  0  0  1  0  0  0  0 
 > pw :0,52

## ITERATION 16 #######################


> Neighbours evaluated; 36
> Selected Move:	4560	3	8	3	22000


> New Y[]: 
	
	 2  3  1  1  1  1  0  0  0  0 


> New S[]: 
	
	 0  1  1  0  0  1  0  0  0  0 
 > pw :0,525

## ITERATION 17 #######################


> Neighbours evaluated; 36
> Selected Move:	4412	3	3	6	21500


> New Y[]: 
	
	 2  3  1  0  1  1  1  0  0  0 


> New S[]: 
	
	 1  1  0  0  1  0  0  0  0  0 
 > pw :0,53

## ITERATION 18 #######################


> Neighbours evaluated; 36
> Selected Move:	4360	2	5	-1	17500


> New Y[]: 
	
	 2  3  1  0  1  0  1  0  0  0 


> New S[]: 
	
	 1  1  0  0  1  0  0  0  0  0 
 > pw :0,535

## ITERATION 19 #######################


> Neighbours evaluated; 35
> Selected Move:	4360	3	0	8	19500


> New Y[]: 
	
	 0  3  1  0  1  0  1  0  2  0 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  1  0 
 > pw :0,54

## ITERATION 20 #######################


> Neighbours evaluated; 31
> Selected Move:	4480	3	6	7	19000


> New Y[]: 
	
	 0  3  1  0  1  0  0  1  2  0 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  1  0 
 > pw :0,545

## ITERATION 21 #######################


> Neighbours evaluated; 30
> Selected Move:	4480	4	8	2	19100


> New Y[]: 
	
	 0  3  2  0  1  0  0  1  1  0 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  1  0 
 > pw :0,55

## ITERATION 22 #######################


> Neighbours evaluated; 31
> Selected Move:	4480	4	2	7	19700


> New Y[]: 
	
	 0  3  1  0  1  0  0  2  1  0 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  1  0 
 > pw :0,555

## ITERATION 23 #######################


> Neighbours evaluated; 30
> Selected Move:	4258	4	7	4	20400


> New Y[]: 
	
	 0  3  1  0  2  0  0  1  1  0 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  1  0 
 > pw :0,56

## ITERATION 24 #######################


> Neighbours evaluated; 29
> Selected Move:	4240	3	7	5	18900


> New Y[]: 
	
	 0  3  1  0  2  1  0  0  1  0 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  1  0 
 > pw :0,555

## ITERATION 25 #######################


> Neighbours evaluated; 31
> Selected Move:	4240	4	4	2	17600


> New Y[]: 
	
	 0  3  2  0  1  1  0  0  1  0 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  1  0 
 > pw :0,55

## ITERATION 26 #######################


> Neighbours evaluated; 30
> Selected Move:	4360	3	5	6	19600


> New Y[]: 
	
	 0  3  2  0  1  0  1  0  1  0 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  1  0 
 > pw :0,545

## ITERATION 27 #######################


> Neighbours evaluated; 29
> Selected Move:	4240	3	8	3	19600


> New Y[]: 
	
	 0  3  2  1  1  0  1  0  0  0 


> New S[]: 
	
	 0  1  1  0  0  0  1  0  0  0 
 > pw :0,54

## ITERATION 28 #######################


> Neighbours evaluated; 31
> Selected Move:	4240	4	2	3	19700


> New Y[]: 
	
	 0  3  1  2  1  0  1  0  0  0 


> New S[]: 
	
	 0  1  1  0  0  0  1  0  0  0 
 > pw :0,535

## ITERATION 29 #######################


> Neighbours evaluated; 29
> Selected Move:	4240	3	6	5	17700


> New Y[]: 
	
	 0  3  1  2  1  1  0  0  0  0 


> New S[]: 
	
	 0  1  1  0  0  1  0  0  0  0 
 > pw :0,53

## ITERATION 30 #######################


> Neighbours evaluated; 31
> Selected Move:	4240	4	3	2	17600


> New Y[]: 
	
	 0  3  2  1  1  1  0  0  0  0 


> New S[]: 
	
	 0  1  1  0  0  1  0  0  0  0 
 > pw :0,525

## ITERATION 31 #######################


> Neighbours evaluated; 29
> Selected Move:	4240	4	2	4	18900


> New Y[]: 
	
	 0  3  1  1  2  1  0  0  0  0 


> New S[]: 
	
	 0  1  1  0  0  1  0  0  0  0 
 > pw :0,52

## ITERATION 32 #######################


> Neighbours evaluated; 29
> Selected Move:	4240	3	4	0	17000


> New Y[]: 
	
	 2  3  1  1  0  1  0  0  0  0 


> New S[]: 
	
	 1  1  0  1  0  0  0  0  0  0 
 > pw :0,515

## ITERATION 33 #######################


> Neighbours evaluated; 35
> Selected Move:	4480	3	5	7	18500


> New Y[]: 
	
	 2  3  1  1  0  0  0  1  0  0 


> New S[]: 
	
	 1  1  0  1  0  0  0  0  0  0 
 > pw :0,51

## ITERATION 34 #######################


> Neighbours evaluated; 35
> Selected Move:	4360	3	7	6	19000


> New Y[]: 
	
	 2  3  1  1  0  0  1  0  0  0 


> New S[]: 
	
	 1  1  0  1  0  0  0  0  0  0 
 > pw :0,505

## ITERATION 35 #######################


> Neighbours evaluated; 34
> Selected Move:	4240	3	2	4	17500


> New Y[]: 
	
	 2  3  0  1  1  0  1  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  1  0  0  0 
 > pw :0,5

## ITERATION 36 #######################


> Neighbours evaluated; 32
> Selected Move:	4240	3	1	2	19800


> New Y[]: 
	
	 2  0  3  1  1  0  1  0  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  1  0  0  0 
 > pw :0,495

## ITERATION 37 #######################


> Neighbours evaluated; 31
> Selected Move:	4240	4	2	3	19700


> New Y[]: 
	
	 2  0  1  3  1  0  1  0  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  1  0  0  0 
 > pw :0,49

## ITERATION 38 #######################


> Neighbours evaluated; 30
> Selected Move:	4240	3	6	5	17700


> New Y[]: 
	
	 2  0  1  3  1  1  0  0  0  0 


> New S[]: 
	
	 1  0  0  1  1  0  0  0  0  0 
 > pw :0,485

## ITERATION 39 #######################


> Neighbours evaluated; 31
> Selected Move:	4240	4	3	2	17800


> New Y[]: 
	
	 2  0  3  1  1  1  0  0  0  0 


> New S[]: 
	
	 1  0  0  1  1  0  0  0  0  0 
 > pw :0,48

## ITERATION 40 #######################


> Neighbours evaluated; 30
> Selected Move:	4240	4	2	4	18600


> New Y[]: 
	
	 2  0  1  1  3  1  0  0  0  0 


> New S[]: 
	
	 1  0  0  1  1  0  0  0  0  0 
 > pw :0,475

## ITERATION 41 #######################


> Neighbours evaluated; 29
> Selected Move:	4240	4	4	5	20000


> New Y[]: 
	
	 2  0  1  1  1  3  0  0  0  0 


> New S[]: 
	
	 1  0  0  1  1  0  0  0  0  0 
 > pw :0,47

## ITERATION 42 #######################


> Neighbours evaluated; 29
> Selected Move:	4240	3	5	1	18000


> New Y[]: 
	
	 2  3  1  1  1  0  0  0  0  0 


> New S[]: 
	
	 1  1  1  0  0  0  0  0  0  0 
 > pw :0,465

## ITERATION 43 #######################


> Neighbours evaluated; 29
> Selected Move:	4438	1	-1	9	22500


> New Y[]: 
	
	 2  3  1  1  1  0  0  0  0  1 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  1 
 > pw :0,46

## ITERATION 44 #######################


> Neighbours evaluated; 35
> Selected Move:	4250	3	3	7	21500


> New Y[]: 
	
	 2  3  1  0  1  0  0  1  0  1 


> New S[]: 
	
	 1  1  0  0  1  0  0  0  0  0 
 > pw :0,455

## ITERATION 45 #######################


> Neighbours evaluated; 35
> Selected Move:	4240	3	7	5	20000


> New Y[]: 
	
	 2  3  1  0  1  1  0  0  0  1 


> New S[]: 
	
	 1  1  0  0  1  0  0  0  0  0 
 > pw :0,45

## ITERATION 46 #######################


> Neighbours evaluated; 32
> Selected Move:	4240	3	2	6	19500


> New Y[]: 
	
	 2  3  0  0  1  1  1  0  0  1 


> New S[]: 
	
	 1  1  0  0  1  0  0  0  0  0 
 > pw :0,445

## ITERATION 47 #######################


> Neighbours evaluated; 33
> Selected Move:	4230	3	5	2	22000


> New Y[]: 
	
	 2  3  1  0  1  0  1  0  0  1 


> New S[]: 
	
	 1  1  0  0  1  0  0  0  0  0 
 > pw :0,44

## ITERATION 48 #######################


> Neighbours evaluated; 32
> Selected Move:	4160	4	0	2	17600


> New Y[]: 
	
	 0  3  2  0  1  0  1  0  0  1 


> New S[]: 
	
	 0  1  1  0  1  0  0  0  0  0 
 > pw :0,435

## ITERATION 49 #######################


> Neighbours evaluated; 30
> Selected Move:	4190	3	9	5	17100


> New Y[]: 
	
	 0  3  2  0  1  1  1  0  0  0 


> New S[]: 
	
	 0  1  1  0  1  0  0  0  0  0 
 > pw :0,43

## ITERATION 50 #######################


> Neighbours evaluated; 27
> Selected Move:	4190	4	2	4	18400


> New Y[]: 
	
	 0  3  1  0  2  1  1  0  0  0 


> New S[]: 
	
	 0  1  1  0  1  0  0  0  0  0 
 > pw :0,425

## ITERATION 51 #######################


> Neighbours evaluated; 29
> Selected Move:	4190	4	4	5	20000


> New Y[]: 
	
	 0  3  1  0  1  2  1  0  0  0 


> New S[]: 
	
	 0  1  1  0  1  0  0  0  0  0 
 > pw :0,42

## ITERATION 52 #######################


> Neighbours evaluated; 27
> Selected Move:	4190	4	5	6	18000


> New Y[]: 
	
	 0  3  1  0  1  1  2  0  0  0 


> New S[]: 
	
	 0  1  1  0  1  0  0  0  0  0 
 > pw :0,415

## ITERATION 53 #######################


> Neighbours evaluated; 28
> Selected Move:	4240	3	6	0	15500


> New Y[]: 
	
	 2  3  1  0  1  1  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  1  0  0  0  0  0 
 > pw :0,41

## ITERATION 54 #######################


> Neighbours evaluated; 25
> Selected Move:	4240	3	0	8	17500


> New Y[]: 
	
	 0  3  1  0  1  1  0  0  2  0 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  1  0 
 > pw :0,405

## ITERATION 55 #######################


> Neighbours evaluated; 25
> Selected Move:	4190	3	1	6	19800


> New Y[]: 
	
	 0  0  1  0  1  1  3  0  2  0 


> New S[]: 
	
	 0  0  1  0  1  0  0  0  1  0 
 > pw :0,4

## ITERATION 56 #######################


> Neighbours evaluated; 27
> Selected Move:	4190	4	6	2	19300


> New Y[]: 
	
	 0  0  3  0  1  1  1  0  2  0 


> New S[]: 
	
	 0  0  1  0  1  0  0  0  1  0 
 > pw :0,395

## ITERATION 57 #######################


> Neighbours evaluated; 28
> Selected Move:	4190	4	2	8	19300


> New Y[]: 
	
	 0  0  2  0  1  1  1  0  3  0 


> New S[]: 
	
	 0  0  1  0  1  0  0  0  1  0 
 > pw :0,39

## ITERATION 58 #######################


> Neighbours evaluated; 26
> Selected Move:	4190	4	8	6	19900


> New Y[]: 
	
	 0  0  2  0  1  1  3  0  1  0 


> New S[]: 
	
	 0  0  1  0  1  0  0  0  1  0 
 > pw :0,385

## ITERATION 59 #######################


> Neighbours evaluated; 25
> Selected Move:	4190	3	8	3	19900


> New Y[]: 
	
	 0  0  2  1  1  1  3  0  0  0 


> New S[]: 
	
	 0  0  1  1  1  0  0  0  0  0 
 > pw :0,38

## ITERATION 60 #######################


> Neighbours evaluated; 27
> Selected Move:	4190	4	2	3	20000


> New Y[]: 
	
	 0  0  1  2  1  1  3  0  0  0 


> New S[]: 
	
	 0  0  1  1  1  0  0  0  0  0 
 > pw :0,375

## ITERATION 61 #######################


> Neighbours evaluated; 26
> Selected Move:	4190	4	6	2	19500


> New Y[]: 
	
	 0  0  3  2  1  1  1  0  0  0 


> New S[]: 
	
	 0  0  1  1  1  0  0  0  0  0 
 > pw :0,37

## ITERATION 62 #######################


> Neighbours evaluated; 27
> Selected Move:	4190	4	2	3	19300


> New Y[]: 
	
	 0  0  2  3  1  1  1  0  0  0 


> New S[]: 
	
	 0  0  1  1  1  0  0  0  0  0 
 > pw :0,365

## ITERATION 63 #######################


> Neighbours evaluated; 24
> Selected Move:	4190	3	2	0	17200


> New Y[]: 
	
	 2  0  0  3  1  1  1  0  0  0 


> New S[]: 
	
	 1  0  0  1  1  0  0  0  0  0 
 > pw :0,36

## ITERATION 64 #######################


> Neighbours evaluated; 29
> Selected Move:	4190	4	3	4	18100


> New Y[]: 
	
	 2  0  0  1  3  1  1  0  0  0 


> New S[]: 
	
	 1  0  0  1  1  0  0  0  0  0 
 > pw :0,355

## ITERATION 65 #######################


> Neighbours evaluated; 29
> Selected Move:	4190	4	4	5	19500


> New Y[]: 
	
	 2  0  0  1  1  3  1  0  0  0 


> New S[]: 
	
	 1  0  0  1  1  0  0  0  0  0 
 > pw :0,35

## ITERATION 66 #######################


> Neighbours evaluated; 21
> Selected Move:	4190	4	5	6	17800


> New Y[]: 
	
	 2  0  0  1  1  1  3  0  0  0 


> New S[]: 
	
	 1  0  0  1  1  0  0  0  0  0 
 > pw :0,345

## ITERATION 67 #######################


> Neighbours evaluated; 26
> Selected Move:	4240	3	6	1	15500


> New Y[]: 
	
	 2  3  0  1  1  1  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  1  0  0  0  0 
 > pw :0,34

## ITERATION 68 #######################


> Neighbours evaluated; 26
> Selected Move:	4240	3	5	7	17000


> New Y[]: 
	
	 2  3  0  1  1  0  0  1  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  1  0  0 
 > pw :0,335

## ITERATION 69 #######################


> Neighbours evaluated; 30
> Selected Move:	4595	1	-1	6	23000


> New Y[]: 
	
	 2  3  0  1  1  0  1  1  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  1  1  0  0 
 > pw :0,33

## ITERATION 70 #######################


> Neighbours evaluated; 35
> Selected Move:	4850	1	-1	5	27000


> New Y[]: 
	
	 2  3  0  1  1  1  1  1  0  0 


> New S[]: 
	
	 1  1  0  0  1  0  0  0  0  0 
 > pw :0,325

## ITERATION 71 #######################


> Neighbours evaluated; 37
> Selected Move:	5013	3	6	2	27500


> New Y[]: 
	
	 2  3  1  1  1  1  0  1  0  0 


> New S[]: 
	
	 1  1  1  0  0  0  0  0  0  0 
 > pw :0,32

## ITERATION 72 #######################


> Neighbours evaluated; 36
> Selected Move:	5020	3	7	6	28000


> New Y[]: 
	
	 2  3  1  1  1  1  1  0  0  0 


> New S[]: 
	
	 0  1  1  0  0  0  1  0  0  0 
 > pw :0,315

## ITERATION 73 #######################


> Neighbours evaluated; 35
> Selected Move:	5113	3	5	9	28500


> New Y[]: 
	
	 2  3  1  1  1  0  1  0  0  1 


> New S[]: 
	
	 0  1  1  0  0  0  1  0  0  0 
 > pw :0,32

## ITERATION 74 #######################


> Neighbours evaluated; 36
> Selected Move:	5070	3	3	8	28500


> New Y[]: 
	
	 2  3  1  0  1  0  1  0  1  1 


> New S[]: 
	
	 0  1  1  0  0  0  1  0  0  0 
 > pw :0,325

## ITERATION 75 #######################


> Neighbours evaluated; 36
> Selected Move:	4980	3	9	5	28000


> New Y[]: 
	
	 2  3  1  0  1  1  1  0  1  0 


> New S[]: 
	
	 0  1  1  0  0  0  1  0  0  0 
 > pw :0,33

## ITERATION 76 #######################


> Neighbours evaluated; 35
> Selected Move:	4910	3	2	7	27000


> New Y[]: 
	
	 2  3  0  0  1  1  1  1  1  0 


> New S[]: 
	
	 1  1  0  0  1  0  0  0  0  0 
 > pw :0,335

## ITERATION 77 #######################


> Neighbours evaluated; 36
> Selected Move:	4828	3	6	2	27500


> New Y[]: 
	
	 2  3  1  0  1  1  0  1  1  0 


> New S[]: 
	
	 0  1  1  0  1  0  0  0  0  0 
 > pw :0,34

## ITERATION 78 #######################


> Neighbours evaluated; 34
> Selected Move:	4590	3	5	9	28000


> New Y[]: 
	
	 2  3  1  0  1  0  0  1  1  1 


> New S[]: 
	
	 0  1  1  0  1  0  0  0  0  0 
 > pw :0,345

## ITERATION 79 #######################


> Neighbours evaluated; 35
> Selected Move:	4660	3	8	3	28000


> New Y[]: 
	
	 2  3  1  1  1  0  0  1  0  1 


> New S[]: 
	
	 1  1  1  0  0  0  0  0  0  0 
 > pw :0,35

## ITERATION 80 #######################


> Neighbours evaluated; 34
> Selected Move:	4505	3	2	6	27500


> New Y[]: 
	
	 2  3  0  1  1  0  1  1  0  1 


> New S[]: 
	
	 1  1  0  0  1  0  0  0  0  0 
 > pw :0,355

## ITERATION 81 #######################


> Neighbours evaluated; 34
> Selected Move:	4528	3	3	8	27500


> New Y[]: 
	
	 2  3  0  0  1  0  1  1  1  1 


> New S[]: 
	
	 1  1  0  0  1  0  0  0  0  0 
 > pw :0,36

## ITERATION 82 #######################


> Neighbours evaluated; 34
> Selected Move:	4520	2	9	-1	23000


> New Y[]: 
	
	 2  3  0  0  1  0  1  1  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  1  1  0  0 
 > pw :0,365

## ITERATION 83 #######################


> Neighbours evaluated; 34
> Selected Move:	4323	3	6	2	23500


> New Y[]: 
	
	 2  3  1  0  1  0  0  1  1  0 


> New S[]: 
	
	 0  1  1  0  0  0  0  1  0  0 
 > pw :0,37

## ITERATION 84 #######################


> Neighbours evaluated; 27
> Selected Move:	4305	3	8	3	23500


> New Y[]: 
	
	 2  3  1  1  1  0  0  1  0  0 


> New S[]: 
	
	 0  1  1  0  0  0  0  1  0  0 
 > pw :0,375

## ITERATION 85 #######################


> Neighbours evaluated; 27
> Selected Move:	4240	4	0	2	19100


> New Y[]: 
	
	 0  3  2  1  1  0  0  1  0  0 


> New S[]: 
	
	 0  1  1  0  0  0  0  1  0  0 
 > pw :0,38

## ITERATION 86 #######################


> Neighbours evaluated; 28
> Selected Move:	4240	4	2	3	19200


> New Y[]: 
	
	 0  3  1  2  1  0  0  1  0  0 


> New S[]: 
	
	 0  1  1  0  0  0  0  1  0  0 
 > pw :0,385

## ITERATION 87 #######################


> Neighbours evaluated; 27
> Selected Move:	4240	4	3	7	19700


> New Y[]: 
	
	 0  3  1  1  1  0  0  2  0  0 


> New S[]: 
	
	 0  1  1  0  0  0  0  1  0  0 
 > pw :0,39

## ITERATION 88 #######################


> Neighbours evaluated; 28
> Selected Move:	4160	3	7	9	19500


> New Y[]: 
	
	 0  3  1  1  1  0  0  0  0  2 


> New S[]: 
	
	 0  1  0  1  1  0  0  0  0  0 
 > pw :0,395

## ITERATION 89 #######################


> Neighbours evaluated; 30
> Selected Move:	4160	4	9	2	18100


> New Y[]: 
	
	 0  3  2  1  1  0  0  0  0  1 


> New S[]: 
	
	 0  1  0  1  1  0  0  0  0  0 
 > pw :0,4

## ITERATION 90 #######################


> Neighbours evaluated; 27
> Selected Move:	4240	3	2	0	16000


> New Y[]: 
	
	 2  3  0  1  1  0  0  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  1 
 > pw :0,395

## ITERATION 91 #######################


> Neighbours evaluated; 28
> Selected Move:	4160	3	0	6	18500


> New Y[]: 
	
	 0  3  0  1  1  0  2  0  0  1 


> New S[]: 
	
	 0  1  0  1  1  0  0  0  0  0 
 > pw :0,39

## ITERATION 92 #######################


> Neighbours evaluated; 27
> Selected Move:	4190	3	9	5	18000


> New Y[]: 
	
	 0  3  0  1  1  1  2  0  0  0 


> New S[]: 
	
	 0  1  0  1  1  0  0  0  0  0 
 > pw :0,385

## ITERATION 93 #######################


> Neighbours evaluated; 27
> Selected Move:	4190	4	6	3	17200


> New Y[]: 
	
	 0  3  0  2  1  1  1  0  0  0 


> New S[]: 
	
	 0  1  0  1  1  0  0  0  0  0 
 > pw :0,38

## ITERATION 94 #######################


> Neighbours evaluated; 27
> Selected Move:	4190	4	3	4	18400


> New Y[]: 
	
	 0  3  0  1  2  1  1  0  0  0 


> New S[]: 
	
	 0  1  0  1  1  0  0  0  0  0 
 > pw :0,375

## ITERATION 95 #######################


> Neighbours evaluated; 25
> Selected Move:	4190	4	4	5	20000


> New Y[]: 
	
	 0  3  0  1  1  2  1  0  0  0 


> New S[]: 
	
	 0  1  0  1  1  0  0  0  0  0 
 > pw :0,37

## ITERATION 96 #######################


> Neighbours evaluated; 26
> Selected Move:	4190	3	3	8	20000


> New Y[]: 
	
	 0  3  0  0  1  2  1  0  1  0 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  1  0 
 > pw :0,365

## ITERATION 97 #######################


> Neighbours evaluated; 28
> Selected Move:	4190	4	5	4	18400


> New Y[]: 
	
	 0  3  0  0  2  1  1  0  1  0 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  1  0 
 > pw :0,36

## ITERATION 98 #######################


> Neighbours evaluated; 27
> Selected Move:	4190	4	4	6	18000


> New Y[]: 
	
	 0  3  0  0  1  1  2  0  1  0 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  1  0 
 > pw :0,355

## ITERATION 99 #######################


> Neighbours evaluated; 26
> Selected Move:	4190	4	6	8	17000


> New Y[]: 
	
	 0  3  0  0  1  1  1  0  2  0 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  1  0 
 > pw :0,35

## ITERATION 100 #######################


> Neighbours evaluated; 24
> Selected Move:	4190	3	4	2	18500


> New Y[]: 
	
	 0  3  1  0  0  1  1  0  2  0 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  1  0 
 > pw :0,345

## ITERATION 101 #######################


> Neighbours evaluated; 26
> Selected Move:	4190	4	8	2	18600


> New Y[]: 
	
	 0  3  2  0  0  1  1  0  1  0 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  1  0 
 > pw :0,34

## ITERATION 102 #######################


> Neighbours evaluated; 25
> Selected Move:	4190	4	2	6	19500


> New Y[]: 
	
	 0  3  1  0  0  1  2  0  1  0 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  1  0 
 > pw :0,335

## ITERATION 103 #######################


> Neighbours evaluated; 25
> Selected Move:	4193	3	5	4	20500


> New Y[]: 
	
	 0  3  1  0  1  0  2  0  1  0 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  1  0 
 > pw :0,33

## ITERATION 104 #######################


> Neighbours evaluated; 26
> Selected Move:	4160	3	2	9	18500


> New Y[]: 
	
	 0  3  0  0  1  0  2  0  1  1 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  1  0 
 > pw :0,325

## ITERATION 105 #######################


> Neighbours evaluated; 28
> Selected Move:	4160	4	6	4	18900


> New Y[]: 
	
	 0  3  0  0  2  0  1  0  1  1 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  1  0 
 > pw :0,32

## ITERATION 106 #######################


> Neighbours evaluated; 29
> Selected Move:	4160	4	4	8	17500


> New Y[]: 
	
	 0  3  0  0  1  0  1  0  2  1 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  1  0 
 > pw :0,315

## ITERATION 107 #######################


> Neighbours evaluated; 27
> Selected Move:	4160	4	8	9	19000


> New Y[]: 
	
	 0  3  0  0  1  0  1  0  1  2 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  1  0 
 > pw :0,31

## ITERATION 108 #######################


> Neighbours evaluated; 27
> Selected Move:	4160	3	6	2	19500


> New Y[]: 
	
	 0  3  1  0  1  0  0  0  1  2 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  1  0 
 > pw :0,305

## ITERATION 109 #######################


> Neighbours evaluated; 28
> Selected Move:	4160	4	9	2	18100


> New Y[]: 
	
	 0  3  2  0  1  0  0  0  1  1 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  1  0 
 > pw :0,3

## ITERATION 110 #######################


> Neighbours evaluated; 25
> Selected Move:	4160	4	2	4	19400


> New Y[]: 
	
	 0  3  1  0  2  0  0  0  1  1 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  1  0 
 > pw :0,295

## ITERATION 111 #######################


> Neighbours evaluated; 27
> Selected Move:	4160	4	4	8	18000


> New Y[]: 
	
	 0  3  1  0  1  0  0  0  2  1 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  1  0 
 > pw :0,29

## ITERATION 112 #######################


> Neighbours evaluated; 25
> Selected Move:	4160	3	4	6	19000


> New Y[]: 
	
	 0  3  1  0  0  0  1  0  2  1 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  1  0 
 > pw :0,285

## ITERATION 113 #######################


> Neighbours evaluated; 26
> Selected Move:	4160	4	8	2	19100


> New Y[]: 
	
	 0  3  2  0  0  0  1  0  1  1 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  1  0 
 > pw :0,28

## ITERATION 114 #######################


> Neighbours evaluated; 24
> Selected Move:	4160	4	2	6	20000


> New Y[]: 
	
	 0  3  1  0  0  0  2  0  1  1 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  1  0 
 > pw :0,275

## ITERATION 115 #######################


> Neighbours evaluated; 24
> Selected Move:	4160	3	8	3	20000


> New Y[]: 
	
	 0  3  1  1  0  0  2  0  0  1 


> New S[]: 
	
	 0  1  1  1  0  0  0  0  0  0 
 > pw :0,27

## ITERATION 116 #######################


> Neighbours evaluated; 30
> Selected Move:	4190	3	9	5	19500


> New Y[]: 
	
	 0  3  1  1  0  1  2  0  0  0 


> New S[]: 
	
	 0  1  1  1  0  0  0  0  0  0 
 > pw :0,265

## ITERATION 117 #######################


> Neighbours evaluated; 26
> Selected Move:	4190	4	6	2	18600


> New Y[]: 
	
	 0  3  2  1  0  1  1  0  0  0 


> New S[]: 
	
	 0  1  1  1  0  0  0  0  0  0 
 > pw :0,26

## ITERATION 118 #######################


> Neighbours evaluated; 26
> Selected Move:	4264	1	-1	4	23600


> New Y[]: 
	
	 0  3  2  1  1  1  1  0  0  0 


> New S[]: 
	
	 0  1  0  1  1  0  0  0  0  0 
 > pw :0,255

## ITERATION 119 #######################


> Neighbours evaluated; 28
> Selected Move:	4525	1	-1	8	30100


> New Y[]: 
	
	 0  3  2  1  1  1  1  0  1  0 


> New S[]: 
	
	 0  1  1  0  0  0  1  0  0  0 
 > pw :0,25

## ITERATION 120 #######################


> Neighbours evaluated; 32
> Selected Move:	4660	3	5	9	30600


> New Y[]: 
	
	 0  3  2  1  1  0  1  0  1  1 


> New S[]: 
	
	 0  1  1  0  0  0  1  0  0  0 
 > pw :0,245

## ITERATION 121 #######################


> Neighbours evaluated; 32
> Selected Move:	4738	4	2	8	30500


> New Y[]: 
	
	 0  3  1  1  1  0  1  0  2  1 


> New S[]: 
	
	 0  1  1  0  0  0  1  0  0  0 
 > pw :0,24

## ITERATION 122 #######################


> Neighbours evaluated; 31
> Selected Move:	4742	4	8	3	30700


> New Y[]: 
	
	 0  3  1  2  1  0  1  0  1  1 


> New S[]: 
	
	 0  1  1  0  0  0  1  0  0  0 
 > pw :0,245

## ITERATION 123 #######################


> Neighbours evaluated; 30
> Selected Move:	4644	3	2	7	29700


> New Y[]: 
	
	 0  3  0  2  1  0  1  1  1  1 


> New S[]: 
	
	 0  1  0  0  1  0  1  0  0  0 
 > pw :0,25

## ITERATION 124 #######################


> Neighbours evaluated; 31
> Selected Move:	4750	3	9	5	29200


> New Y[]: 
	
	 0  3  0  2  1  1  1  1  1  0 


> New S[]: 
	
	 0  1  0  0  1  0  1  0  0  0 
 > pw :0,255

## ITERATION 125 #######################


> Neighbours evaluated; 31
> Selected Move:	4755	4	3	8	29000


> New Y[]: 
	
	 0  3  0  1  1  1  1  1  2  0 


> New S[]: 
	
	 0  1  0  0  1  0  1  0  0  0 
 > pw :0,26

## ITERATION 126 #######################


> Neighbours evaluated; 31
> Selected Move:	4580	3	6	2	29500


> New Y[]: 
	
	 0  3  1  1  1  1  0  1  2  0 


> New S[]: 
	
	 0  1  1  0  1  0  0  0  0  0 
 > pw :0,265

## ITERATION 127 #######################


> Neighbours evaluated; 31
> Selected Move:	4506	4	8	2	29600


> New Y[]: 
	
	 0  3  2  1  1  1  0  1  1  0 


> New S[]: 
	
	 0  1  1  0  1  0  0  0  0  0 
 > pw :0,27

## ITERATION 128 #######################


> Neighbours evaluated; 31
> Selected Move:	4431	4	2	3	29700


> New Y[]: 
	
	 0  3  1  2  1  1  0  1  1  0 


> New S[]: 
	
	 0  1  1  0  1  0  0  0  0  0 
 > pw :0,275

## ITERATION 129 #######################


> Neighbours evaluated; 29
> Selected Move:	4295	3	7	6	30200


> New Y[]: 
	
	 0  3  1  2  1  1  1  0  1  0 


> New S[]: 
	
	 0  1  1  0  0  0  1  0  0  0 
 > pw :0,28

## ITERATION 130 #######################


> Neighbours evaluated; 28
> Selected Move:	4300	4	3	8	30000


> New Y[]: 
	
	 0  3  1  1  1  1  1  0  2  0 


> New S[]: 
	
	 0  1  1  0  0  0  1  0  0  0 
 > pw :0,285

## ITERATION 131 #######################


> Neighbours evaluated; 27
> Selected Move:	4203	2	3	-1	23500


> New Y[]: 
	
	 0  3  1  0  1  1  1  0  2  0 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  1  0 
 > pw :0,29

## ITERATION 132 #######################


> Neighbours evaluated; 27
> Selected Move:	4161	4	1	4	20100


> New Y[]: 
	
	 0  0  1  0  3  1  1  0  2  0 


> New S[]: 
	
	 0  0  1  0  1  0  0  0  1  0 
 > pw :0,295

## ITERATION 133 #######################


> Neighbours evaluated; 24
> Selected Move:	4190	3	8	0	18100


> New Y[]: 
	
	 2  0  1  0  3  1  1  0  0  0 


> New S[]: 
	
	 1  0  1  0  1  0  0  0  0  0 
 > pw :0,3

## ITERATION 134 #######################


> Neighbours evaluated; 29
> Selected Move:	4190	4	4	2	17300


> New Y[]: 
	
	 2  0  3  0  1  1  1  0  0  0 


> New S[]: 
	
	 1  0  1  0  1  0  0  0  0  0 
 > pw :0,305

## ITERATION 135 #######################


> Neighbours evaluated; 26
> Selected Move:	4190	4	2	5	19500


> New Y[]: 
	
	 2  0  1  0  1  3  1  0  0  0 


> New S[]: 
	
	 1  0  1  0  1  0  0  0  0  0 
 > pw :0,31

## ITERATION 136 #######################


> Neighbours evaluated; 26
> Selected Move:	4190	4	5	6	17800


> New Y[]: 
	
	 2  0  1  0  1  1  3  0  0  0 


> New S[]: 
	
	 1  0  1  0  1  0  0  0  0  0 
 > pw :0,315

## ITERATION 137 #######################


> Neighbours evaluated; 24
> Selected Move:	4190	3	4	3	19300


> New Y[]: 
	
	 2  0  1  1  0  1  3  0  0  0 


> New S[]: 
	
	 1  0  1  1  0  0  0  0  0  0 
 > pw :0,32

## ITERATION 138 #######################


> Neighbours evaluated; 28
> Selected Move:	4190	4	6	2	18800


> New Y[]: 
	
	 2  0  3  1  0  1  1  0  0  0 


> New S[]: 
	
	 1  0  1  1  0  0  0  0  0  0 
 > pw :0,315

## ITERATION 139 #######################


> Neighbours evaluated; 27
> Selected Move:	4190	4	2	3	18700


> New Y[]: 
	
	 2  0  1  3  0  1  1  0  0  0 


> New S[]: 
	
	 1  0  1  1  0  0  0  0  0  0 
 > pw :0,31

## ITERATION 140 #######################


> Neighbours evaluated; 26
> Selected Move:	4190	3	3	1	16500


> New Y[]: 
	
	 2  3  1  0  0  1  1  0  0  0 


> New S[]: 
	
	 1  1  1  0  0  0  0  0  0  0 
 > pw :0,305

## ITERATION 141 #######################


> Neighbours evaluated; 28
> Selected Move:	4285	1	-1	3	23000


> New Y[]: 
	
	 2  3  1  1  0  1  1  0  0  0 


> New S[]: 
	
	 1  1  0  1  0  0  0  0  0  0 
 > pw :0,3

## ITERATION 142 #######################


> Neighbours evaluated; 29
> Selected Move:	4400	3	5	4	24000


> New Y[]: 
	
	 2  3  1  1  1  0  1  0  0  0 


> New S[]: 
	
	 0  1  1  0  0  0  1  0  0  0 
 > pw :0,295

## ITERATION 143 #######################


> Neighbours evaluated; 22
> Selected Move:	4828	1	-1	7	29500


> New Y[]: 
	
	 2  3  1  1  1  0  1  1  0  0 


> New S[]: 
	
	 1  1  0  0  1  0  0  0  0  0 
 > pw :0,29

## ITERATION 144 #######################


> Neighbours evaluated; 31
> Selected Move:	4885	3	3	8	29500


> New Y[]: 
	
	 2  3  1  0  1  0  1  1  1  0 


> New S[]: 
	
	 0  1  1  0  1  0  0  0  0  0 
 > pw :0,285

## ITERATION 145 #######################


> Neighbours evaluated; 31
> Selected Move:	4460	2	7	-1	24000


> New Y[]: 
	
	 2  3  1  0  1  0  1  0  1  0 


> New S[]: 
	
	 0  1  1  0  0  0  1  0  0  0 
 > pw :0,29

## ITERATION 146 #######################


> Neighbours evaluated; 25
> Selected Move:	4330	3	4	5	23000


> New Y[]: 
	
	 2  3  1  0  0  1  1  0  1  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  1  0 
 > pw :0,295

## ITERATION 147 #######################


> Neighbours evaluated; 31
> Selected Move:	4283	3	6	7	22500


> New Y[]: 
	
	 2  3  1  0  0  1  0  1  1  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  1  0 
 > pw :0,3

## ITERATION 148 #######################


> Neighbours evaluated; 35
> Selected Move:	4270	3	8	3	22500


> New Y[]: 
	
	 2  3  1  1  0  1  0  1  0  0 


> New S[]: 
	
	 1  1  0  1  0  0  0  0  0  0 
 > pw :0,305

## ITERATION 149 #######################


> Neighbours evaluated; 32
> Selected Move:	4025	3	5	9	23000


> New Y[]: 
	
	 2  3  1  1  0  0  0  1  0  1 


> New S[]: 
	
	 1  1  0  1  0  0  0  0  0  0 
 > pw :0,31

## ITERATION 150 #######################


> Neighbours evaluated; 34
> Selected Move:	4160	2	7	-1	17500


> New Y[]: 
	
	 2  3  1  1  0  0  0  0  0  1 


> New S[]: 
	
	 1  1  0  1  0  0  0  0  0  0 
 > pw :0,315

## ITERATION 151 #######################


> Neighbours evaluated; 29
> Selected Move:	4160	3	0	4	19400


> New Y[]: 
	
	 0  3  1  1  2  0  0  0  0  1 


> New S[]: 
	
	 0  1  0  1  1  0  0  0  0  0 
 > pw :0,32

## ITERATION 152 #######################


> Neighbours evaluated; 26
> Selected Move:	4160	4	4	3	18200


> New Y[]: 
	
	 0  3  1  2  1  0  0  0  0  1 


> New S[]: 
	
	 0  1  0  1  1  0  0  0  0  0 
 > pw :0,325

## ITERATION 153 #######################


> Neighbours evaluated; 25
> Selected Move:	4160	3	2	6	17700


> New Y[]: 
	
	 0  3  0  2  1  0  1  0  0  1 


> New S[]: 
	
	 0  1  0  1  1  0  0  0  0  0 
 > pw :0,33

## ITERATION 154 #######################


> Neighbours evaluated; 26
> Selected Move:	4160	4	3	4	18900


> New Y[]: 
	
	 0  3  0  1  2  0  1  0  0  1 


> New S[]: 
	
	 0  1  0  1  1  0  0  0  0  0 
 > pw :0,335

## ITERATION 155 #######################


> Neighbours evaluated; 24
> Selected Move:	4160	4	4	9	19000


> New Y[]: 
	
	 0  3  0  1  1  0  1  0  0  2 


> New S[]: 
	
	 0  1  0  1  1  0  0  0  0  0 
 > pw :0,33

## ITERATION 156 #######################


> Neighbours evaluated; 24
> Selected Move:	4160	3	3	2	19000


> New Y[]: 
	
	 0  3  1  0  1  0  1  0  0  2 


> New S[]: 
	
	 0  1  1  0  1  0  0  0  0  0 
 > pw :0,325

## ITERATION 157 #######################


> Neighbours evaluated; 23
> Selected Move:	4160	4	9	4	18900


> New Y[]: 
	
	 0  3  1  0  2  0  1  0  0  1 


> New S[]: 
	
	 0  1  1  0  1  0  0  0  0  0 
 > pw :0,32

## ITERATION 158 #######################


> Neighbours evaluated; 24
> Selected Move:	4160	4	4	6	18500


> New Y[]: 
	
	 0  3  1  0  1  0  2  0  0  1 


> New S[]: 
	
	 0  1  1  0  1  0  0  0  0  0 
 > pw :0,315

## ITERATION 159 #######################


> Neighbours evaluated; 21
> Selected Move:	4160	3	6	0	16000


> New Y[]: 
	
	 2  3  1  0  1  0  0  0  0  1 


> New S[]: 
	
	 1  1  0  0  1  0  0  0  0  0 
 > pw :0,31

## ITERATION 160 #######################


> Neighbours evaluated; 23
> Selected Move:	4160	3	1	3	18200


> New Y[]: 
	
	 2  0  1  3  1  0  0  0  0  1 


> New S[]: 
	
	 1  0  0  1  1  0  0  0  0  0 
 > pw :0,305

## ITERATION 161 #######################


> Neighbours evaluated; 29
> Selected Move:	4240	3	9	7	19200


> New Y[]: 
	
	 2  0  1  3  1  0  0  1  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  1  0  0 
 > pw :0,3

## ITERATION 162 #######################


> Neighbours evaluated; 28
> Selected Move:	4240	4	3	2	19300


> New Y[]: 
	
	 2  0  3  1  1  0  0  1  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  1  0  0 
 > pw :0,295

## ITERATION 163 #######################


> Neighbours evaluated; 28
> Selected Move:	4240	4	2	7	20000


> New Y[]: 
	
	 2  0  1  1  1  0  0  3  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  1  0  0 
 > pw :0,29

## ITERATION 164 #######################


> Neighbours evaluated; 28
> Selected Move:	4211	4	7	4	20100


> New Y[]: 
	
	 2  0  1  1  3  0  0  1  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  1  0  0 
 > pw :0,285

## ITERATION 165 #######################


> Neighbours evaluated; 27
> Selected Move:	4160	3	7	9	19100


> New Y[]: 
	
	 2  0  1  1  3  0  0  0  0  1 


> New S[]: 
	
	 1  0  0  1  1  0  0  0  0  0 
 > pw :0,28

## ITERATION 166 #######################


> Neighbours evaluated; 28
> Selected Move:	4160	4	4	2	18300


> New Y[]: 
	
	 2  0  3  1  1  0  0  0  0  1 


> New S[]: 
	
	 1  0  0  1  1  0  0  0  0  0 
 > pw :0,275

## ITERATION 167 #######################


> Neighbours evaluated; 26
> Selected Move:	4160	4	2	9	20000


> New Y[]: 
	
	 2  0  1  1  1  0  0  0  0  3 


> New S[]: 
	
	 1  0  0  1  1  0  0  0  0  0 
 > pw :0,27

## ITERATION 168 #######################


> Neighbours evaluated; 26
> Selected Move:	4160	3	2	6	19500


> New Y[]: 
	
	 2  0  0  1  1  0  1  0  0  3 


> New S[]: 
	
	 1  0  0  1  1  0  0  0  0  0 
 > pw :0,265

## ITERATION 169 #######################


> Neighbours evaluated; 24
> Selected Move:	4160	4	9	3	17700


> New Y[]: 
	
	 2  0  0  3  1  0  1  0  0  1 


> New S[]: 
	
	 1  0  0  1  1  0  0  0  0  0 
 > pw :0,26

## ITERATION 170 #######################


> Neighbours evaluated; 28
> Selected Move:	4160	4	3	4	18600


> New Y[]: 
	
	 2  0  0  1  3  0  1  0  0  1 


> New S[]: 
	
	 1  0  0  1  1  0  0  0  0  0 
 > pw :0,255

## ITERATION 171 #######################


> Neighbours evaluated; 26
> Selected Move:	4160	4	4	6	18300


> New Y[]: 
	
	 2  0  0  1  1  0  3  0  0  1 


> New S[]: 
	
	 1  0  0  1  1  0  0  0  0  0 
 > pw :0,25

## ITERATION 172 #######################


> Neighbours evaluated; 25
> Selected Move:	4165	3	9	2	20300


> New Y[]: 
	
	 2  0  1  1  1  0  3  0  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  1  0  0  0 
 > pw :0,245

## ITERATION 173 #######################


> Neighbours evaluated; 22
> Selected Move:	4160	3	3	9	18300


> New Y[]: 
	
	 2  0  1  0  1  0  3  0  0  1 


> New S[]: 
	
	 1  0  0  0  1  0  1  0  0  0 
 > pw :0,24

## ITERATION 174 #######################


> Neighbours evaluated; 27
> Selected Move:	4160	4	6	2	17800


> New Y[]: 
	
	 2  0  3  0  1  0  1  0  0  1 


> New S[]: 
	
	 1  0  0  0  1  0  1  0  0  0 
 > pw :0,235

## ITERATION 175 #######################


> Neighbours evaluated; 27
> Selected Move:	4160	4	2	4	18600


> New Y[]: 
	
	 2  0  1  0  3  0  1  0  0  1 


> New S[]: 
	
	 1  0  0  0  1  0  1  0  0  0 
 > pw :0,23

## ITERATION 176 #######################


> Neighbours evaluated; 27
> Selected Move:	4160	4	4	9	19500


> New Y[]: 
	
	 2  0  1  0  1  0  1  0  0  3 


> New S[]: 
	
	 1  0  0  0  1  0  1  0  0  0 
 > pw :0,225

## ITERATION 177 #######################


> Neighbours evaluated; 24
> Selected Move:	4130	3	2	8	19500


> New Y[]: 
	
	 2  0  0  0  1  0  1  0  1  3 


> New S[]: 
	
	 0  0  0  0  1  0  1  0  0  1 
 > pw :0,22

## ITERATION 178 #######################


> Neighbours evaluated; 29
> Selected Move:	4130	4	9	4	18600


> New Y[]: 
	
	 2  0  0  0  3  0  1  0  1  1 


> New S[]: 
	
	 0  0  0  0  1  0  1  0  0  1 
 > pw :0,215

## ITERATION 179 #######################


> Neighbours evaluated; 28
> Selected Move:	4130	4	4	6	18300


> New Y[]: 
	
	 2  0  0  0  1  0  3  0  1  1 


> New S[]: 
	
	 0  0  0  0  1  0  1  0  0  1 
 > pw :0,21

## ITERATION 180 #######################


> Neighbours evaluated; 28
> Selected Move:	4130	4	6	8	17700


> New Y[]: 
	
	 2  0  0  0  1  0  1  0  3  1 


> New S[]: 
	
	 0  0  0  0  1  0  1  0  0  1 
 > pw :0,205

## ITERATION 181 #######################


> Neighbours evaluated; 27
> Selected Move:	4259	1	-1	2	24200


> New Y[]: 
	
	 2  0  1  0  1  0  1  0  3  1 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  1  0 
 > pw :0,2

## ITERATION 182 #######################


> Neighbours evaluated; 33
> Selected Move:	4460	3	9	5	23700


> New Y[]: 
	
	 2  0  1  0  1  1  1  0  3  0 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  1  0 
 > pw :0,195

## ITERATION 183 #######################


> Neighbours evaluated; 32
> Selected Move:	4479	3	8	3	23700


> New Y[]: 
	
	 2  0  1  3  1  1  1  0  0  0 


> New S[]: 
	
	 1  0  0  1  1  0  0  0  0  0 
 > pw :0,19

## ITERATION 184 #######################


> Neighbours evaluated; 28
> Selected Move:	4478	4	3	2	23800


> New Y[]: 
	
	 2  0  3  1  1  1  1  0  0  0 


> New S[]: 
	
	 1  0  0  1  1  0  0  0  0  0 
 > pw :0,185

## ITERATION 185 #######################


> Neighbours evaluated; 28
> Selected Move:	4497	3	3	8	23800


> New Y[]: 
	
	 2  0  3  0  1  1  1  0  1  0 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  1  0 
 > pw :0,19

## ITERATION 186 #######################


> Neighbours evaluated; 30
> Selected Move:	4393	3	6	7	23300


> New Y[]: 
	
	 2  0  3  0  1  1  0  1  1  0 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  1  0 
 > pw :0,195

## ITERATION 187 #######################


> Neighbours evaluated; 33
> Selected Move:	4396	4	2	8	23200


> New Y[]: 
	
	 2  0  1  0  1  1  0  1  3  0 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  1  0 
 > pw :0,2

## ITERATION 188 #######################


> Neighbours evaluated; 32
> Selected Move:	4380	3	8	3	23200


> New Y[]: 
	
	 2  0  1  3  1  1  0  1  0  0 


> New S[]: 
	
	 1  0  0  1  1  0  0  0  0  0 
 > pw :0,205

## ITERATION 189 #######################


> Neighbours evaluated; 30
> Selected Move:	4344	4	3	2	23300


> New Y[]: 
	
	 2  0  3  1  1  1  0  1  0  0 


> New S[]: 
	
	 1  0  0  1  1  0  0  0  0  0 
 > pw :0,21

## ITERATION 190 #######################


> Neighbours evaluated; 29
> Selected Move:	4180	4	2	7	24000


> New Y[]: 
	
	 2  0  1  1  1  1  0  3  0  0 


> New S[]: 
	
	 1  0  0  1  1  0  0  0  0  0 
 > pw :0,215

## ITERATION 191 #######################


> Neighbours evaluated; 31
> Selected Move:	4276	3	7	6	24300


> New Y[]: 
	
	 2  0  1  1  1  1  3  0  0  0 


> New S[]: 
	
	 1  0  0  1  1  0  0  0  0  0 
 > pw :0,22

## ITERATION 192 #######################


> Neighbours evaluated; 25
> Selected Move:	4254	3	3	8	24300


> New Y[]: 
	
	 2  0  1  0  1  1  3  0  1  0 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  1  0 
 > pw :0,225

## ITERATION 193 #######################


> Neighbours evaluated; 28
> Selected Move:	4165	4	6	4	24600


> New Y[]: 
	
	 2  0  1  0  3  1  1  0  1  0 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  1  0 
 > pw :0,23

## ITERATION 194 #######################


> Neighbours evaluated; 29
> Selected Move:	4144	4	0	2	20200


> New Y[]: 
	
	 0  0  2  0  3  1  1  0  1  0 


> New S[]: 
	
	 0  0  1  0  1  0  0  0  1  0 
 > pw :0,235

## ITERATION 195 #######################


> Neighbours evaluated; 23
> Selected Move:	4143	3	8	3	20200


> New Y[]: 
	
	 0  0  2  1  3  1  1  0  0  0 


> New S[]: 
	
	 0  0  1  1  1  0  0  0  0  0 
 > pw :0,24

## ITERATION 196 #######################


> Neighbours evaluated; 24
> Selected Move:	4118	4	2	3	20300


> New Y[]: 
	
	 0  0  1  2  3  1  1  0  0  0 


> New S[]: 
	
	 0  0  1  1  1  0  0  0  0  0 
 > pw :0,245

## ITERATION 197 #######################


> Neighbours evaluated; 24
> Selected Move:	4190	3	4	1	18700


> New Y[]: 
	
	 0  3  1  2  0  1  1  0  0  0 


> New S[]: 
	
	 0  1  1  1  0  0  0  0  0  0 
 > pw :0,25

## ITERATION 198 #######################


> Neighbours evaluated; 23
> Selected Move:	4275	1	-1	4	23700


> New Y[]: 
	
	 0  3  1  2  1  1  1  0  0  0 


> New S[]: 
	
	 0  1  0  1  1  0  0  0  0  0 
 > pw :0,255

## ITERATION 199 #######################


> Neighbours evaluated; 24
> Selected Move:	4204	3	6	7	23200


> New Y[]: 
	
	 0  3  1  2  1  1  0  1  0  0 


> New S[]: 
	
	 0  1  0  1  1  0  0  0  0  0 
 > pw :0,26

## ITERATION 200 #######################


> Neighbours evaluated; 30
> Selected Move:	4288	3	2	8	23200


> New Y[]: 
	
	 0  3  0  2  1  1  0  1  1  0 


> New S[]: 
	
	 0  1  0  0  0  1  0  1  0  0 
 > pw :0,265

## ITERATION 201 #######################


> Neighbours evaluated; 31
> Selected Move:	4537	3	7	9	22200


> New Y[]: 
	
	 0  3  0  2  1  1  0  0  1  1 


> New S[]: 
	
	 0  1  0  0  0  1  0  0  0  1 
 > pw :0,27

## ITERATION 202 #######################


> Neighbours evaluated; 33
> Selected Move:	4580	4	3	8	22000


> New Y[]: 
	
	 0  3  0  1  1  1  0  0  2  1 


> New S[]: 
	
	 0  1  0  0  0  1  0  0  0  1 
 > pw :0,275

## ITERATION 203 #######################


> Neighbours evaluated; 33
> Selected Move:	4295	3	9	7	23000


> New Y[]: 
	
	 0  3  0  1  1  1  0  1  2  0 


> New S[]: 
	
	 0  1  0  0  0  1  0  1  0  0 
 > pw :0,28

## ITERATION 204 #######################


> Neighbours evaluated; 30
> Selected Move:	4180	3	3	2	23000


> New Y[]: 
	
	 0  3  1  0  1  1  0  1  2  0 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  1  0 
 > pw :0,285

## ITERATION 205 #######################


> Neighbours evaluated; 28
> Selected Move:	4137	4	8	2	23100


> New Y[]: 
	
	 0  3  2  0  1  1  0  1  1  0 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  1  0 
 > pw :0,29

## ITERATION 206 #######################


> Neighbours evaluated; 29
> Selected Move:	4156	3	7	6	23600


> New Y[]: 
	
	 0  3  2  0  1  1  1  0  1  0 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  1  0 
 > pw :0,295
________________________________________________________________

Best solution found: 5240
Run Termination time: 31.01.2010 10:33:57
Run duration: 00:01:33.7968750
________________________________________________________________
